Circuit-size lower bounds and non-reducibility to sparse sets
نویسندگان
چکیده
منابع مشابه
Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets
As remarked in Cook ("Towards a Complexity Theory of Synchronous Parallel Computation," Univ. of Toronto, 1980), a nonlinear lower bound on the circuit-size of a language in P or even in NP is not known. The best known published lower bound seems to be due to Paul ("Proceedings, 7th ACM Symposium on Theory of Computing," 1975). In this paper it is shown first that for each nonnegative integer k...
متن کاملSparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds
It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets in EXP, or even in EXP that are not computable by polynomial size circuits and hence are not reducible to a sparse set. In this paper we study th...
متن کاملSparse Selfreducible Sets and Nonuniform Lower Bounds
It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets in EXP, or even in EXP that are not computable by polynomial size circuits and hence are not reducible to a sparse set. In this paper we study th...
متن کاملRelating Equivalence and Reducibility to Sparse Sets
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distinguishing equivalence and reducibility to sparse sets, for many-one or 1-truth-table reductions, would imply that P 6= NP, this paper shows that for k-truth-table reductions, k 2, equivalence and reducibility to sparse...
متن کاملDerandomizing the Isolation Lemma and Lower Bounds for Circuit Size
The isolation lemma of Mulmuley et al [MVV87] is an important tool in the design of randomized algorithms and has played an important role in several nontrivial complexity upper bounds. On the other hand, polynomial identity testing is a well-studied algorithmic problem with efficient randomized algorithms and the problem of obtaining efficient deterministic identity tests has received a lot of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1982
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(82)90382-5